A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Senthilmurugan, T.
- Re-Pro Routing Protocol with Performance Comparison of Mobile Ad hoc Network Protocols
Authors
1 Vel Tech DR.RR & DR.SR Technical University, Avadi, Chennai, IN
2 Department of CSE, Vel tech DR.RR & DR.SR Technical University, Avadi, Chennai, IN
Source
Wireless Communication, Vol 3, No 6 (2011), Pagination: 435-439Abstract
In this paper, we present new protocol design scenario like Re - Pro Routing Protocol (RPRP) for Broadcasting in wireless mobile Ad-hoc Network and a comparative performance for Mobile Ad hoc Networks protocols like as Ad-hoc On-Demand Distance Vector Routing protocol focusing on the effects of changes such as the increasing number of receivers or sources and increasing the number of nodes. Although some simulation results of MANET protocols have been published before, these protocols have not been compared in isolation. A systematic performance evaluation of these protocols is done by performing certain simulations under NS2.Keywords
MANET, Reactive Routing Protocol, Proactive Routing Protocol, Broadcasting.
- Memory Management by Using Association Rules Mining and Mine Frequent Pattern in Large Data Base
Authors
1 School of Computer Science & Engineering, Vel Tech Dr.RR & Dr.SR Technical University, Avadi, Chennai-600 062, IN
Source
Data Mining and Knowledge Engineering, Vol 2, No 12 (2010), Pagination:Abstract
Association rules mining Rely on special data structures for the database in the primary memory. These data structure resides in the main memory, but these to handle the storage problem when they go out of the primary memory.VMM stores the overload data into the secondary memory based on some pre assumed memory handling method. So, it will arise the thrashing. This problem is solved by using ARM model capable of mining a transactional data base regardless of its size. The proposed data structure is constructed in the available allocated primary memory first. If it is grows out of the allocated memory quato them it forced to the secondary memory. The secondary memory version of the structure is accessed in a block-by-block basis so that both the spatial and temporal localities of the I/O access are optimized. the proposed framework takes control of the virtual memory access and hence manages the required virtual memory in an optimal way to the best benefit of the mining process to be served. Several clever data structures are used to facilitate these optimizations. Main purpose of this paper is to allocate memory and control this memory managing with the algorithm support.